New families of binary sequences with optimal three-level autocorrelation

نویسندگان

  • Cunsheng Ding
  • Tor Helleseth
  • Halvard Martinsen
چکیده

In this correspondence we give several new families of binary sequences of period with optimal three-level autocorrelation, where 2(mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Class of Almost Difference Sets Constructed by Using the Ding-Helleseth-Martinsens Constructions

Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost difference set as their characteristic sets. How to construct new families of almost difference set is an important research topic in such fields as communicatio...

متن کامل

NPAutMel.tex, 2.02.01, M.G.Parker Even Length Binary Sequence Families with Optimal and Near-Optimal Negaperiodic Autocorrelation

Cyclotomic constructions are given for several infinite families of even length binary sequences, which have optimal or near-optimal negaperiodic autocorrelation. It appears that two of the constructions have an asymptotic Merit Factor of 6.0 which is very high. Mappings from periodic to negaperiodic autocorrelation are also discussed.

متن کامل

New construction for families of binary sequences with optimal correlation properties

In this correspondence, we present a construction, in a closed form, for an optimal family of 2m binary sequences of period 2 1 with respect to Welch’s bound, whenever there exists a balanced binary sequence of period 2m 1 with ideal autocorrelation property using the trace function. This construction enables us to reinterpret a small set of Kasami and No sequences as a family constructed from ...

متن کامل

Almost difference sets and their sequences with optimal autocorrelation

Almost difference sets have interesting applications in cryptography and coding theory. In this paper, we give a wellrounded treatment of known families of almost difference sets, establish relations between some difference sets and some almost difference sets, and determine the numerical multiplier group of some families of almost difference sets. We also construct six new classes of almost di...

متن کامل

New Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences

Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2001